sparse matrix algorithm

См. также в других словарях:

• Sparse matrix — A sparse matrix obtained when solving a finite element problem in two dimensions. The non zero elements are shown in black. In the subfield of numerical analysis, a sparse matrix is a matrix populated primarily with zeros (Stoer Bulirsch 2002,… …   Wikipedia

• Sparse array — In computer science, a sparse array is an array in which most of the elements have the same value (known as the default value usually 0 or null).A naive implementation of an array may allocate space for the entire array, but in the case where… …   Wikipedia

• Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia

• Matrix-free methods — In computational mathematics, a matrix free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix vector… …   Wikipedia

• Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… …   Wikipedia

• Minimum degree algorithm — In numerical analysis the minimum degree algorithm is an algorithm used to permute the rows and columns of a symmetric sparse matrix before applying the Cholesky decomposition, to reduce the number of non zeros in the Cholesky factor. This… …   Wikipedia

• Band matrix — In mathematics, particularly matrix theory, a band matrix is a sparse matrix whose non zero entries are confined to a diagonal band, comprising the main diagonal and zero or more diagonals on either side. Contents 1 Matrix bandwidth 2… …   Wikipedia

• Skyline matrix — A skyline matrix, or a variable band matrix, is a form of a sparse matrix storage format for a square, banded (and typically symmetric) matrix that reduces the storage requirement of a matrix more than banded storage. In banded storage, all… …   Wikipedia

• Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… …   Wikipedia

• Block Wiedemann algorithm — The Block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalisation of an algorithm due to Don Coppersmith. Coppersmith s algorithm Let M be an n imes n square matrix over some finite field F, let x… …   Wikipedia

• Faugère F4 algorithm — In computer algebra, the Faugère F4 algorithm, by Jean Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring. The algorithm uses the same mathematical principles as the Buchberger algorithm, but computes many… …   Wikipedia